Pragmatic subtyping in polymorphic languages
نویسندگان
چکیده
منابع مشابه
Polymorphic subtyping in O'Haskell
O’Haskell is a programming language derived from Haskell by the addition of concurrent reactive objects and subtyping. Because Haskell already encompasses an advanced type system with polymorphism and overloading, the type system of O’Haskell is much richer than what is the norm in almost any widespread object-oriented or functional language. Yet, there is strong evidence that O’Haskell is not ...
متن کاملPolymorphic Subtyping Without Distributivity
The subtyping relation in the polymorphic second-order-calculus was introduced by John C. Mitchell in 1988. It is known that this relation is undecidable, but all known proofs of this fact strongly depend on the distributivity axiom. Nevertheless it has been conjectured that this axiom does not innuence the undecidability. The present paper shows undecidability of subtyping when we remove distr...
متن کاملPolymorphic lambda calculus and subtyping
We present a denotational model for F<, the extension of second-order lambda calculus with subtyping defined in [Cardelli Wegner 1985]. Types are interpreted as arbitrary cpos and elements of types as natural transformations. We prove the soundness of our model with respect to the equational theory of F< [Cardelli et al. 1991] and show coherence. Our model is of independent interest, because it...
متن کاملSubtyping First-Class Polymorphic Components
We present a statically typed, class-based object oriented language where classes are first class polymorphic values. A main contribution of this work is the design of a type system that combines first class polymorphic values with structural equirecursive types and admits a subtyping algorithm which is arguably much simpler than existing alternatives. Our development is modular and can be easi...
متن کاملOptimal Representations of Polymorphic Types with Subtyping
Many type inference and program analysis systems include notions of subtyping and parametric polymorphism. When used together, these two features induce equivalences that allow types to be simpli ed by eliminating quanti ed variables. Eliminating variables both improves the readability of types and the performance of algorithms whose complexity depends on the number of type variables. We presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 1999
ISSN: 0362-1340,1558-1160
DOI: 10.1145/291251.289445